Decentralized Transaction Mechanism Based on Smart Contract in Distributed Data Storage
نویسندگان
چکیده
منابع مشابه
Distributed Data Storage Systems for Data Survivability in Wireless Sensor Networks using Decentralized Erasure Codes
Achieving reliability in Wireless Sensor Networks (WSNs) is challenging due to the limited resources available. In this study, we investigate the design of data survivability schemes using decentralized storage systems in WSNs. We propose a data storage system design based on Decentralized Erasure Codes (DEC) that features a simple and decentralized construction of the target code. The proposed...
متن کاملFile Version Based Continuous Data Protection on Distributed Object Storage
Continuous Data Protection (CDP) can restore data to any point-in-time, but high storage overhead and drastic system performance drop restricts its application. In this paper, we propose a file version based file level CDP system (FV-CDP) by using cheap distributed storage for backup to low down the storage costs and using local object cache and parralel asynchronous object sending to mask netw...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملA Decentralized Monitoring Mechanism for Distributed Applications
For a complex distributed system to be dependable, it must be continuously monitored, so that its failures and imperfections can be discovered and corrected in a timely manner. This work is concerned with the monitoring of large, open and heterogeneous applications. Our objective is a monitoring technique that satisfies the following properties: scalability with respect to the size of the syste...
متن کاملTowards Decentralized Distributed Data Structures
We motivate and present a simple measure of eeciency for distributed data structures called \bottleneck complexity". We investigate a distributed counter as a case study for our measure of eeciency. A distributed counter allows each processor in an asynchronous message passing network to access the counter value and increment it. The bottleneck complexity has a lower bound of (k) on an asynchro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2018
ISSN: 2078-2489
DOI: 10.3390/info9110286